Applying the Interleave Bound to Splay Trees
نویسنده
چکیده
We give a discussion of the Interleave Bound for dynamic optimal binary search, along with some new properties and results. We attempt to apply these results to Splay Trees, in the hope of working towards a proof that splay trees are O(lg lg n)-competitive. Some partial results and conjectures are formulated.
منابع مشابه
On the sequential access theorem and deque conjecture for splay trees
We give a new, simple proof for the sequential access theorem for splay trees. For an n-node splay tree, our bound on the number of rotations is 4:5n, with a smaller constant than the bound of 10:8n concluded by Tarjan. We extend our proof to prove the deque conjecture for output-restricted deques. Our proofs provide additional insights into the workings of splay trees. c © 2004 Elsevier B.V. A...
متن کاملInorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the trees reasonably well balanced through a ‘splay heuristic.’ Sleator and Tarjan showed that if amortised rather than worst-case times are considered, splay trees are optimal. Splay trees have the advantage of simplicity: th...
متن کاملSkip-Splay: Toward Achieving the Unified Bound in the BST Model
We present skip-splay, the first binary search tree algorithm known to have a running time that nearly achieves the unified bound. Skip-splay trees require only O(m lg lg n + UB(σ)) time to execute a query sequence σ = σ1 . . . σm. The skip-splay algorithm is simple and similar to the splay algorithm.
متن کاملA Study on Splay Trees
We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be easier to prove. This approach may be useful to establish dynamic optimality.
متن کاملProperties of Multi-Splay Trees
Introduced a new binary search tree algorithm, cache-splay, that was the first to achieve the Unified Bound of Iacono since this problem was posed in 2001, and showed that the lower bound framework (see below) applied to a more general model of computation than binary search. Additionally, my thesis summarized my previous work on developing both lower bounds and upper bounds on the cost of sequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005